全文获取类型
收费全文 | 2067篇 |
免费 | 105篇 |
国内免费 | 174篇 |
学科分类
工业技术 | 2346篇 |
出版年
2024年 | 6篇 |
2023年 | 49篇 |
2022年 | 94篇 |
2021年 | 107篇 |
2020年 | 46篇 |
2019年 | 25篇 |
2018年 | 34篇 |
2017年 | 50篇 |
2016年 | 44篇 |
2015年 | 67篇 |
2014年 | 121篇 |
2013年 | 96篇 |
2012年 | 101篇 |
2011年 | 178篇 |
2010年 | 99篇 |
2009年 | 145篇 |
2008年 | 153篇 |
2007年 | 117篇 |
2006年 | 132篇 |
2005年 | 86篇 |
2004年 | 94篇 |
2003年 | 69篇 |
2002年 | 72篇 |
2001年 | 34篇 |
2000年 | 36篇 |
1999年 | 41篇 |
1998年 | 28篇 |
1997年 | 31篇 |
1996年 | 28篇 |
1995年 | 27篇 |
1994年 | 21篇 |
1993年 | 16篇 |
1992年 | 13篇 |
1991年 | 10篇 |
1990年 | 16篇 |
1989年 | 3篇 |
1988年 | 10篇 |
1987年 | 5篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1974年 | 2篇 |
排序方式: 共有2346条查询结果,搜索用时 15 毫秒
1.
A double optimal projection method that involves projections for intra-cluster and inter-cluster dimensionality reduction are proposed for video fingerprinting. The video is initially set as a graph with frames as its vertices in a high-dimensional space. A similarity measure that can compute the weights of the edges is then proposed. Subsequently, the video frames are partitioned into different clusters based on the graph model. Double optimal projection is used to explore the optimal mapping points in a low-dimensional space to reduce the video dimensions. The statistics and geometrical fingerprints are generated to determine whether a query video is copied from one of the videos in the database. During matching, the video can be roughly matched by utilizing the statistics fingerprint. Further matching is thereafter performed in the corresponding group using geometrical fingerprints. Experimental results show the good performance of the proposed video fingerprinting method in robustness and discrimination. 相似文献
2.
Action calculi, which generalise process calculi such as Petri nets, π-calculusand ambient calculus, have been presented
in terms of action graphs. We here offer linear action graphs as a primitive basis for action calculi. This paper presents the category of embeddings of undirected linear
action graphs without nesting, using a novel form of graphical reasoning which simplifies some otherwise complex manipulations
in regular algebra. The results are adapted in a few lines to directed graphs. This work is part of a long-term search for
a uniform behavioural theory for process calculi.
Received October 2000 / Accepted in revised form April 2001 相似文献
3.
Many problems consist in splitting a set of objects into different groups so that each group verifies some properties. In practice, a partitioning is often encoded by an array mapping each object to its group numbering. In fact, the group number of an object does not really matter, and one can simply rename each group to obtain a new encoding. That is what we call the symmetry of the search space in a partitioning problem. This property may be prejudicial for optimization methods such as evolutionary algorithms (EA) which require some diversity during the search. 相似文献
4.
5.
6.
Doratha E Drake 《Information Processing Letters》2003,85(4):211-213
We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [STACS'99, Lecture Notes in Comput. Sci., Vol. 1563, 1999, pp. 259-269]. Our algorithm uses a new approach which is much simpler than the one given by Preis and needs no amortized analysis for its running time. 相似文献
7.
8.
This paper demonstrates how the problem of tracking targets, which appear as either straight or curved lines in two-dimensional display images (or data images) can be formulated in terms of a directed weighted graph model and how dynamic programming techniques can be efficiently applied to reach an optimal or sub-optimal solution. In general, track detection algorithms providing optimal solutions have good detective ability, but most of them suffer from the inability to detect discontinuous lines or to resolve efficiently pairs of crossing lines. A sub-optimal solution is provided that efficiently overcomes these weaknesses. We focus on modeling the track detection problem in terms of a graph, formulating fast sequential/parallel sub-optimal track detection algorithms and testing them on simulated data in order to show their detective ability. Moreover, we specify the conditions under which sub-optimal algorithms can perform at least as well as their corresponding optimal algorithms. This is significant for the track detection problem where fast, accurate and real-time detection is considered a necessity. 相似文献
9.
This paper deals with the problem of finding graph layerings restricted to a given maximal width. However, other than previous approaches for width-restricted layering, we take into account the space for dummy nodes, which are introduced by edges crossing a layer. The main result is that the problem of finding a width-restricted layering under consideration of dummy nodes is NP-complete even when all regular nodes have the same constant width and all dummy nodes have the same constant width. 相似文献
10.
Jae-Ha Lee 《Information Processing Letters》2002,81(5):265-270
The k-searcher is a mobile guard whose visibility is limited to k rays emanating from her position, where the direction of each ray can be changed continuously with bounded angular rotation speed. Given a polygonal region P, is it possible for the k-searcher to eventually see a mobile intruder that is arbitrarily faster than the searcher within P? We present O(n2)-time algorithms for constructing a search schedule of the 1-searcher and the 2-searcher, respectively. Our framework for the 1-searcher can be viewed as a modification of that of LaValle et al. [Proc. 16th ACM Symp. on Computational Geometry, 2000, pp. 260-269] and is naturally extended for the 2-searcher. 相似文献